Insensitivity of a network of symmetric queues with balanced service rates
نویسنده
چکیده
Previous insensitivity results on queueing systems include on one hand, e.g., symmetric queues in isolation and, on the other hand, networks of processor sharing queues with globally dependent balanced service rates, i.e. so-called Whittle networks. In this paper we show that insensitivity property of a queueing network with balanced service rates is retained when each of the processor sharing nodes is replaced by any kind of symmetric queue.
منابع مشابه
A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملA heuristic method for consumable resource allocation in multi-class dynamic PERT networks
This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...
متن کاملبهدست آوردن میانگین زمان تکمیلپروژه در شبکههای پرتپویا (سیستم چندپروژهای) با ظرفیت محدود
In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کامل